//https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/submissions/551393268/

class Solution {
public:
    vector<int> searchRange(vector<int>& nums, int target) {
        if (nums.size() == 0)
            return { -1,-1 };

        vector<int> v;
        //1.查找左端点
        int left = 0, right = nums.size() - 1;
        int mid = 0;
        while (left < right)
        {
            mid = left + (right - left) / 2;
            if (nums[mid] < target)
                left = mid + 1;
            else
                right = mid;
        }
        if (nums[left] != target) return { -1,-1 };
        else v.push_back(left);

        //查找右端点
        right = nums.size() - 1;
        while (left < right)
        {
            mid = left + (right - left + 1) / 2;
            if (nums[mid] <= target)
                left = mid;
            else
                right = mid - 1;
        }
        v.push_back(right);

        return v;

    }
};